Regenerative cascade homotopies for solving polynomial systems

A key step in the numerical computation of the irreducible decomposition of a polynomial system is the computation of a witness superset of the solution set. In many problems involving a solution set of a polynomial system, the witness superset contains all the needed information. Sommese and Wampler gave the first numerical method to compute witness supersets, based on dimension-by-dimension slicing of the solution set by generic linear spaces, followed later by the cascade homotopy of Sommese and Verschelde. Recently, the authors of this article introduced a new method, regeneration, to compute solution sets of polynomial systems. Tests showed that combining regeneration with the dimension-by-dimension algorithm was significantly faster than naively combining it with the cascade homotopy. However, in this article, we combine an appropriate randomization of the polynomial system with the regeneration technique to construct a new cascade of homotopies for computing witness supersets. Computational tests give strong evidence that regenerative cascade is superior in practice to previous methods.     

On the solution of a mixed nonlinear integral equation

In this paper, we consider a mixed nonlinear integral equation of the second kind in position and time. The existence of a unique solution of this equation is discussed and proved. A numerical method is used to obtain a system of Harmmerstein integral equations of the second kind in position. Then the modified Toeplitz matrix method, as a numerical method, is used to obtain a nonlinear algebraic system. Many important theorems related to the existence and uniqueness solution to the produced nonlinear algebraic system are derived. The rate of convergence of the total error is discussed. Finally, numerical examples when the kernel of position takes a logarithmic and Carleman forms, are presented and the error estimate, in each case, is calculated.     

Optimal control of harvest and bifurcation of a prey-predator model with stage structure

This paper describes a prey-predator model with stage structure for prey. The adult prey and predator populations are harvested in the proposed system. The dynamic behavior of the model system is discussed. It is observed that singularity induced bifurcation phenomenon is appeared when variation of the economic interest of harvesting is taken into account. State feedback controller is incorporated to stabilize the model system in case of positive economic interest. Harvesting of prey and predator population are used as controls to develop a dynamic framework to investigate the optimal utilization of the resource, sustainability properties of the stock and the resource rent earned from the resource. The Pontryagin’s maximum principle is used to characterize the optimal controls. The optimality system is derived and then solved numerically using an iterative method with Runge-Kutta fourth order scheme. Simulation results show that the optimal control scheme can achieve sustainable ecosystem.     

First-order system least squares and the energetic variational approach for two-phase flow

This paper develops a first-order system least-squares (FOSLS) formulation for equations of two-phase flow. The main goal is to show that this discretization, along with numerical techniques such as nested iteration, algebraic multigrid, and adaptive local refinement, can be used to solve these types of complex fluid flow problems. In addition, from an energetic variational approach, it can be shown that an important quantity to preserve in a given simulation is the energy law. We discuss the energy law and inherent structure for two-phase flow using the Allen–Cahn interface model and indicate how it is related to other complex fluid models, such as magnetohydrodynamics. Finally, we show that, using the FOSLS framework, one can still satisfy the appropriate energy law globally while using well-known numerical techniques.     

Parallel multigrid method for finite element simulations of complex flow problems on locally refined meshes

We present a parallel multigrid solver on locally refined meshes for solving very complex three‐dimensional flow problems. Besides describing the parallel implementation in detail, we prove the smoothing property of the suggested iteration for a simple model problem. For demonstration of the efficiency and feasibility of the solver, we show a chemically reactive flow simulation for a Methane burner using detailed chemical reaction modeling. Further, we give the results of an ocean flow simulation. All described methods are implemented in the finite element toolbox Gascoigne. Copyright © 2010 John Wiley & Sons, Ltd.     

图形处理器并行计算用于离子发动机粒子模拟

 为了研究离子发动机羽流对航天器的影响,采用质点网格-蒙特卡罗碰撞方法对离子发动机羽流中的交换电荷离子进行了模拟。利用计算设备统一架构技术,开发出一套基于图形处理器的并行粒子模拟程序。随机数生成采用并行MT19937伪随机数生成器算法,电场方程使用完全近似存储格式的代数多重网格法求解。r-z轴对称坐标系中,在z=0 m处获得的电流密度均值为4.5×10^-5 A/m²,图形处理器所得结果与中央处理器模拟结果吻合。在16核心的NVIDIA GeForce 9400 GT图形显示卡上,取得相对于Intel Core 2 E6300中央处理器4.5~10.0倍的加速比。     

随机对流扩散方程的数值仿真

本文针对对流一扩散随机过程在随机输入（即随机输运和源项）,作用下进行数值仿真。我们先将对流扩散随机微分方程中的随机函数采用有限项截断的多项式浑沌展开（Polynomial Chaos Expansion）展开,再由Galerkin映射法得到求解浑沌展开系数的确定性方程组。这是一个在物理空间包含多尺度解的大方程组。为此我...     

Mixed‐order interpolation for the Galerkin coarse‐grid approximations in algebraic multigrid solvers

An empirical investigation is made of AMG solver performance for the fully coupled set of Navier–Stokes equations. The investigation focuses on two different FV discretizations for the standard driven cavity test problem. One is a collocated vertex‐based discretization; the other is a cell‐centred staggered‐grid discretization. Both employ otherwise identical orthogonal Cartesian meshes. It is found that if mixed‐order interpolation is used in the construction of the Galerkin coarse‐grid approximation (CGA), a close‐to‐optimum mesh‐independent scaling of the AMG convergence is observed with similar convergence rates for both discretizations. If, on the other hand, an equal‐order interpolation is used, convergence rates are mesh‐dependent but the scaling differs in each case. For the collocated‐grid case, it depends both on the mesh size, h (or bandwidth Q～h^?1) and on the total number of grids, G, whereas for the staggered‐grid case it depends only on Q. Comparing the two characteristics reveals that the Q‐dependent parts are very similar; it is only in the G‐dependent convergence for the collocated‐grid case that they differ. This takes the form of stepped reductions in the AMG convergence rate (implying step reductions in the quality of the Galerkin CGA that correlate exactly with step increases in G). These findings reinforce previous evidence that, for optimum mesh‐independent performance, mixed‐order interpolations should be used in forming Galerkin CGAs for coupled Navier–Stokes problems. Copyright © 2010 John Wiley & Sons, Ltd.     

Investigation and application of point implicit Runge–Kutta methods to inviscid flow problems

We derive and investigate point implicit Runge–Kutta methods to significantly improve the convergence rate to approximate steady‐state solutions of inviscid flows. It turns out that the point implicit Runge–Kutta can be interpreted as a preconditioned explicit Runge–Kutta method, where the preconditioner arises naturally as local derivative of the residual function. Moreover, many preconditioners suggested in the literature so far are identified as special case of our general ansatz. Conditions will be formulated such that explicit Runge–Kutta methods with local time stepping are equivalent to point implicit methods. In numerical examples, we will demonstrate the improved convergence rates. Copyright © 2011 John Wiley & Sons, Ltd.